Multi-Objective Evolutionary Algorithm NSGA-II for Variables Selection in Multivariate Calibration Problems

نویسندگان

  • Daniel Victor de Lucena
  • Telma Woerle de Lima
  • Anderson da Silva Soares
  • Clarimar José Coelho
چکیده

This paper proposes a multiobjective formulation for variable selection in multivariate calibration problems in order to improve the generalization ability of the calibration model. The authors applied this proposed formulation in the multiobjective genetic algorithm NSGA-II. The formulation consists in two conflicting objectives: minimize the prediction error and minimize the number of selected variables for multiple linear regression. These objectives are conflicting because, when the number of variables is reduced the prediction error increases. As study of case is used the wheat data set obtained by NIR spectrometry with the objective for determining a variable subgroup with information about protein concentration. The results of traditional techniques of multivariate calibration as the partial least square and successive projection algorithm for multiple linear regression are presented for comparisons. The obtained results showed that the proposed approach obtained better results when compared with a mono-objective evolutionary algorithm and with traditional techniques of multivariate calibration. Multi-Objective Evolutionary Algorithm NSGA-II for Variables Selection in Multivariate Calibration Problems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM USING DECOMPOSITION (MOEA/D) AND ITS APPLICATION IN MULTIPURPOSE MULTI-RESERVOIR OPERATIONS

This paper presents a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for the optimal operation of a complex multipurpose and multi-reservoir system. Firstly, MOEA/D decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. It uses information of its several neighboring sub-problems for optimizin...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

A Method for Pre-Calibration of DI Diesel Engine Emissions and Performance Using Neural Network and Multi-Objective Genetic Algorithm

Diesel engine emission standards are being more stringent as it gains more publicity in industry and transportation. Hence, designers have to suggest new controlling strategies which result in small amounts of emissions and a reasonable fuel economy. To achieve such a target, multi-objective optimization methodology is a good approach inasmuch as several types of ...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJNCR

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2012